A Boyer–Moore-style algorithm for regular expression pattern matching

A Boyer-Moore-style algorithm for regular expression pattern matching

Richard E. Watson Dept. of Mathematics Simon Fraser University Burnaby B.C., Canada watsona@sfu. ca This paper presents a Boyer-Moore type algorithm for regular expression pattern matching, answering an open problem posed by A. V. Aho in 1980 [Aho80, p. 3421. The new algorithm handles patterns specified by regular expressions a generalization of the Boyer-Moore and Commentz-Walter algorithms (w...

Regular Expression Pattern Matching - A Simpler Design

A new algorithm for linear regular tree pattern matching

We consider the problem of linear regular tree pattern matching and describe a new solution based on a bottom up technique. Current bottom up techniques preprocess the patterns and construct a nite state tree pattern matching automaton for the purpose. Though matching time is linear in the size of the subject tree, the size of the automaton can be exponential in the sum of the sizes of all patt...

Efficient Fpga-based Regular Expression Pattern Matching

An approach to the automatic generation of efficient Field Programmable Gate Arrays (FPGAs) circuits for the Regular Expression-based (RegEx) Pattern Matching problems is presented. Using a novel design strategy, as proposed, circuits that are highly area-and-time-efficient can be automatically generated for arbitrary sets of regular expressions. This makes the technique suitable for applicatio...

A Subquadratic Algorithm for Approximate Regular Expression Matching

The main result of this paper is an algorithm for approximate matching of a regular expression of size m in a text of size n in time O(nm/ log d + 2 n), where d is the number of allowed errors. This algorithm is the first o(mn) algorithm for approximate matching to regular expressions.